A unified and efficient solution to the room search problem

A unified and efficient solution to the room search problem

We study the problem of searching for a mobile intruder in a polygonal region P with a door d (called a room) by a mobile searcher. The objective is to decide whether there exists a search schedule for the searcher to detect the intruder without allowing him to exit P through d, no matter how fast he moves, and if so, generate a search schedule. A searcher is called the k-searcher if he holds k...

An Optimal Solution to Room Search Problem

A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem

The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...

A Pragmatic Solution to the Value Problem of Knowledge

We value possessing knowledge more than true belief. Both someone with knowledge and someone with a true belief possess the correct answer to a question. Why is knowledge more valuable than true belief if both contain the correct answer? I examine the philosophy of American pragmatist John Dewey and then I offer a novel solution to this question often called the value problem of knowledge. I pr...

A fair and efficient solution to the socialist millionaires' problem

We present a solution to the Tiercé problem, in which two players want to know whether they have backed the same combination (but neither player wants to disclose its combination to the other one). The problem is also known as the socialist millionaires’ problem, in which two millionaires want to know whether they happen to be equally rich. In our solution, both players will be convinced of the...